Resultant-Based Methods for Plane Curves Intersection Problems
نویسندگان
چکیده
We present an algorithm for solving polynomial equations, which uses generalized eigenvalues and eigenvectors of resultant matrices. We give special attention to the case of two bivariate polynomials and the Sylvester or Bezout resultant constructions. We propose a new method to treat multiple roots, detail its numerical aspects and describe experiments on tangential problems, which show the efficiency of the approach. An industrial application of the method is presented at the end of the paper. It consists in recovering cylinders from a large cloud of points and requires intensive resolution of polynomial equations.
منابع مشابه
Tropical Resultants for Curves and Stable Intersection
We introduce the notion of resultant of two planar curves in the tropical geometry framework. We prove that the tropicalization of the algebraic resultant can be used to compute the stable intersection of two tropical plane curves. It is shown that, for two generic preimages of the curves to an algebraic framework, their intersection projects exactly onto the stable intersection of the curves. ...
متن کاملInflexion Points on Plane Algebraic Curves
In this thesis we will have a look at algebraic curves in the projective plane over an arbitrary algebraically closed field k. Using the resultant of polynomial rings over k we define intersection multiplicities and prove Bézout’s Theorem for effective divisors. We define singularities and inflexion points and count their number depending on the degree of the curve, using the Hessian of a curve.
متن کاملNumeric certified algorithm for the topology of resultant and discriminant curves
Let C be a real plane algebraic curve defined by the resultant of two polynomials (resp. by the discriminant of a polynomial). Geometrically such a curve is the projection of the intersection of the surfaces P (x, y, z) = Q(x, y, z) = 0 (resp. P (x, y, z) = ∂P ∂z (x, y, z) = 0), and generically its singularities are nodes (resp. nodes and ordinary cusp). State-of-the-art numerical algorithms ca...
متن کاملA tracing method for parametric Bezier triangular surface/plane intersection
Surface/plane intersection problem is a special case of surface/surface intersection, and is an active area of research across many disciplines in computer-aided geometric design. This paper presents, in general the setting of derivational continuities, (i.e. C, C, and C), a surface/plane intersection algorithm for parametric Bézier triangular surface over triangular domain. The present algorit...
متن کاملComputing quadric surface intersections based on an analysis of plane cubic curves
Computing the intersection curve of two quadrics is a fundamental problem in computer graphics and solid modeling. We present an algebraic method for classifying and parameterizing the intersection curve of two quadric surfaces. The method is based on the observation that the intersection curve of two quadrics is birationally related to a plane cubic curve. In the method this plane cubic curve ...
متن کامل